Institute for Theoretical Information Technology

Publications by Thomas Niessen

2001

• M. Hellebrandt, J. Kind, R. Mathar, T. Niessen, Performance evaluation of space division multiplexing by a Markovian mobility model, Technical Report, RWTH-Aachen, 2001.

2000

• R. Mathar, T. Niessen, Optimum positioning of base stations for cellular radio networks, Wireless Networks, vol. 6, no. 4, pp. 421-428, 2000.
• T. Niessen, J. Kind, The round-up property of the fractional chromatic number for proper circular arc graphs, Journal of Graph Theory, vol. 33, pp. 256-267, 2000.

1999

• K. Tuschku, R. Mathar, T. Niessen, Interference minimization in wireless communication systems by optimal cell site selection, Proceedings: EPMCC'99, Paris, 1999.
• M. Hellebrandt, F. Lambrecht, R. Mathar, T. Niessen, R. Starke, Frequency allocation and linear programming, Proceedings: IEEE VTC, Houston, 1999.

1998

• T. Niessen, A characterization of graphs having all (g,f)-factors, Journal of Combinatorial Theory, Series B, vol. 72, no. 1, pp. 152--156, 1998.
• T. Niessen, B. Randerath, Regular factors of simple regular graphs, and factor spectra, Discrete Mathematics, vol. 85, pp. 89-103, 1998.
• J. Kind, T. Niessen, R. Mathar, Theory of Maximum Packing and related allocation strategies for cellular radio networks, Mathematical Methods of Operations Research, vol. 48, no. 1, pp. 1-16, 1998.

1997

• T. Niessen, A Fan-type condition for regular factors, Ars Combin, vol. 46, pp. 277-285, 1997.
• T. Niessen, Complete closure and regular factors, J. Comb. Math. Comb. Comput., vol. 25, pp. 145-160, 1997.
• T. Niessen, Optimal channel allocation for several types of cellular radio networks, Discrete Applied Mathematics, vol. 79, pp. 155-170, 1997.

1995

• T. Niessen, Optimal channel assignment in cellular radio networks with linear structure, ITG-Fachberichte, vol. 135, pp. 181-187, September 1995.
• T. Niessen, Neighborhood unions and regular factors, J. Graph Theory, vol. 19, pp. 45-64, 1995.

1994

• P. Dankelmann, T. Niessen, I. Schiermeyer, On path-tough graphs, SIAM J. Discrete Math., vol. 7, pp. 571-584, 1994.
• T. Niessen, How to find overfull subgraphs in graphs with large maximum degree, Discrete Appl. Math., vol. 51, pp. 117-125, 1994.
• D. Bauer, T. Niessen, E. Schmeichel, Neighborhood unions, degree sums, toughness and 2-factors, Congress. Numer., vol. 100, pp. 47-57, 1994.

1992

• T. Niessen, Nash-Williams conditions and the existence of k-factors, Ars Combin, vol. 34, pp. 251-256, 1992.

1990

• T. Niessen, L. Volkmann, Class 1 conditions depending on the minimum degree and the number of vertices of maximum degree, J. Graph Theory, 1990.